The Nondeterministic Waiting Time Algorithm: A Review
نویسندگان
چکیده
Department of Computer Science – Louisiana Tech University P. O. Box 10137 – Ruston – Louisiana – 71272 – USA Bioinformatics Department – National Institute of Research and Development for Biological Sciences Splaiul Independenţei, Nr. 296 – Sector 6 – Bucharest – Romania Departamento de Inteligencia Artificial – Facultad de Informática – Universidad Politécnica de Madrid Campus de Montegancedo S/N – Boadilla del Monte – 28660 Madrid – Spain
منابع مشابه
Finding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملPublic transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کاملPatient waiting time in hospital emergency departments of Iran: A systematic review and meta-analysis
Background: Waiting time in emergency department is a key indicator in measuring the quality of hospital services and has a significant impact on patient satisfaction The purpose of this study was to conduct a systematic review and meta-analysis of the patients' waiting time in hospital emergency departments in Iran. Methods: Data were collected from databases of Web of Science, E...
متن کاملA single server perishable inventory system with N additional options for service
This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them dema...
متن کاملGreen Vehicle Routing Problem with Safety and Social Concerns
Over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. These aspects are the economic, the environmental, the social and the safety aspects. In the Vehicle Routing Problem (VRP) literature, the economic issue has often been used, while the environmen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009